Invariant measures of critical branching random walks in high dimension

نویسندگان

چکیده

In this work, we characterize cluster-invariant point processes for critical branching spatial on Rd all large enough d when the motion law is α-stable or has a finite discrete range. More precisely, with α≤2 and offspring μ of process an heavy tail such that μ(k)∼k−2−β, then need dimension to be strictly larger than α∕β. particular, Brownian second moment, 2. Contrary previous work Bramson, Cox Greven in [4] whose proof used PDE techniques, our uses probabilistic tools only.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Approximating Critical Parameters of Branching Random Walks

Given a branching random walk on a graph, we consider two kinds of truncations: by inhibiting the reproduction outside a subset of vertices and by allowing at most m particles per site. We investigate the convergence of weak and strong critical parameters of these truncated branching random walks to the analogous parameters of the original branching random walk. As a corollary, we apply our res...

متن کامل

Occupation Statistics of Critical Branching Random Walks

We consider a critical nearest neighbor branching random walk on the d−dimensional integer lattice. Denote by Vm the maximal number of particles at a single site at time m, and by Gm the event that the branching random walk survives to generation m. We show that if the offspring distribution has finite n-th moment, then in dimensions d ≥ 3, conditional on Gm, Vm = Op(m 1 n ); and if the offspri...

متن کامل

Branching Random Walks

We study a generalized branching random walk where particles breed at a rate which depends on the number of neighbouring particles. Under general assumptions on the breeding rates we prove the existence of a phase where the population survives without exploding. We construct a non trivial invariant measure for this case.

متن کامل

Minima in Branching Random Walks

Given a branching random walk, let Mn be the minimum position of any member of the n’th generation. We calculate EMn to within O(1) and prove exponential tail bounds for P {|Mn − EMn| > x}, under quite general conditions on the branching random walk. In particular, together with work of [8], our results fully characterize the possible behavior of EMn when the branching random walk has bounded b...

متن کامل

Maxima of Branching Random Walks

In recent years several authors have obtained limit theorems for Ln, the location of the rightmost particle in a supercritical branching random walk but all of these results have been proved under the assumption that the offspring distribution has (p(O)=.fexp(Ox)dF(x)0. In this paper we investigate what happens when there is a slowly varying function K so that 1-F(x)~x-qK(x) as x...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Electronic Journal of Probability

سال: 2023

ISSN: ['1083-6489']

DOI: https://doi.org/10.1214/23-ejp906